Relating word and tree automata
نویسندگان
چکیده
منابع مشابه
Relating Word and Tree Automata
In the automata-theoretic approach to verification, we translate specifications to automata. Complexity considerations motivate the distinction between different types of automata. Already in the 60’s, it was known that deterministic Büchi word automata are less expressive than nondeterministic Büchi word automata. The proof is easy and can be stated in a few lines. In the late 60’s, Rabin prov...
متن کاملRelating Hierarchies of Word and Tree Automata
For an !-word language L, the derived tree language Path(L) is the language of trees having all their paths in L. We consider the hierarchies of deterministic automata on words and nondeterministic automata on trees with Rabin conditions in chain form. We show that L is on some level of the hierarchy of deterministic word automata ii Path(L) is on the same level of the hierarchy of nondetermini...
متن کاملRelating Tree Series Transducers and Weighted Tree Automata
Bottom-up tree series transducers (tst) over the semiring A are implemented with the help of bottom-up weighted tree automata (wta) over an extension of A. Therefore bottom-up D-weighted tree automata (D-wta) with D a distributive Ω-algebra are introduced. A D-wta is essentially a wta but uses as transition weight an operation symbol of the Ω-algebra D instead of a semiring element. The given t...
متن کاملRelating Word and Tree Automata - Logic in Computer Science, 1996. LICS '96. Proceedings., Eleventh Annual IEEE Symposium on
I n the automata-theoretic approach to verification, we translate specifications to automata. Complexity considerations motivate the distinction between different types of automata. Already in the 60's) it was known that deterministic Biichi word automata are less expressive than nondeterministic Biichi word automata. The proof is easy and can be stated in a few lines. I n the late 60's) Rabin ...
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2006
ISSN: 0168-0072
DOI: 10.1016/j.apal.2005.06.009